منابع مشابه
Robust facility location
Let A be a nonempty nite subset of the plane representing the geographical coordinates of a set of demand points (towns,. . .), to be served by a facility, whose location within a given region S is sought. Assuming that the unit cost for a 2 A if the facility is located at x 2 S is proportional to dist(x; a) | the distance from x to a | and that demand of point a is given by ! a , minimizing th...
متن کاملRobust Fault Tolerant Uncapacitated Facility Location
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities. This paper concerns the robust fault-tolerant version of the uncapacitated facility location problem (RFTFL). In this pr...
متن کاملThe Recoverable Robust Facility Location Problem
This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second st...
متن کاملFacility Location: A Robust Optimization Approach
I n this research, we apply robust optimization (RO) to the problem of locating facilities in a network facing uncertain demand over multiple periods. We consider a multi-period fixed-charge network location problem for which we find (1) the number of facilities, their location and capacities, (2) the production in each period, and (3) allocation of demand to facilities. Using the RO approach w...
متن کاملApproximate robust optimization for the Connected Facility Location problem
In this paper we consider the Robust Connected Facility Location (ConFL) problem within the robust discrete optimization framework introduced by Bertsimas and Sim [7]. We propose an Approximate Robust Optimization (ARO) method that uses a heuristic and a lower bounding mechanism to rapidly find high-quality solutions. The use of a heuristic and a lower bounding mechanism—as opposed to solving t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research (ZOR)
سال: 2003
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s001860300294